tree decodingの例文

例文

1. Non-reverse bit-tree decoding works by keeping a pointer to the tree of variables, which starts at the root.
2. Reverse bit-tree decoding instead decodes from least significant bit to most significant bits, and thus only supports ranges that are powers of two, and always decodes the same number of bits.
3. Non-reverse bit-tree decoding thus happens from most significant to least significant bit, stopping when only one value in the valid range is possible ( this conceptually allows to have range sizes that are not powers of two, even though LZMA doesn't make use of this ).